翻訳と辞書 Words near each other ・ Ługowo ・ Ługowo, Strzelce-Drezdenko County ・ Ługowo, West Pomeranian Voivodeship ・ Ługowo, Zielona Góra County ・ Ługwałd ・ Ługów, Lublin Voivodeship ・ Ługów, Lubusz Voivodeship ・ Ługówka ・ Łuh (Bieszczady) ・ Łuk coat of arms ・ Łuka, Podlaskie Voivodeship ・ Łuka, Warmian-Masurian Voivodeship ・ Łukanowice ・ Łukasiewicz ・ Łukasiewicz logic ・ Łukasiewicz–Moisil algebra ・ Łukasz ・ Łukasz Abgarowicz ・ Łukasz Adamczyk ・ Łukasz Banak ・ Łukasz Bocian ・ Łukasz Bodnar ・ Łukasz Broź ・ Łukasz Budziłek ・ Łukasz Burliga ・ Łukasz Chyła ・ Łukasz Cichos ・ Łukasz Ciepliński ・ Łukasz Cyborowski ・ Łukasz Czapla Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Łukasiewicz–Moisil algebra ： ウィキペディア英語版 Łukasiewicz–Moisil algebra Łukasiewicz–Moisil algebras (LM''n'' algebras) were introduced in the 1940s by Grigore Moisil (initially under the name of Łukasiewicz algebras〔Andrei Popescu, ''(Łukasiewicz-Moisil Relation Algebras )'', Studia Logica, Vol. 81, No. 2 (Nov., 2005), pp. 167-189〕) in the hope of giving algebraic semantics for the ''n''-valued Łukasiewicz logic. However, in 1956 Alan Rose discovered that for ''n'' ≥ 5, the Łukasiewicz–Moisil algebra does not model the Łukasiewicz logic. A faithful model for the ℵ0-valued (infinitely-many-valued) Łukasiewicz–Tarski logic was provided by C. C. Chang's MV-algebra, introduced in 1958. For the axiomatically more complicated (finite) ''n''-valued Łukasiewicz logics, suitable algebras were published in 1977 by Revaz Grigolia and called MV''n''-algebras. MV''n''-algebras are a subclass of LM''n''-algebras, and the inclusion is strict for ''n'' ≥ 5.〔Iorgulescu, A.: Connections between MV''n''-algebras and ''n''-valued Łukasiewicz-Moisil algebras—I. Discrete Math. 181, 155–177 (1998) 〕 In 1982 Roberto Cignoli published some additional constraints that added to LM''n''-algebras produce proper models for ''n''-valued Łukasiewicz logic; Cignoli called his discovery proper Łukasiewicz algebras.〔R. Cignoli, Proper n-Valued Łukasiewicz Algebras as S-Algebras of Łukasiewicz ''n''-Valued Propositional Calculi, Studia Logica, 41, 1982, 3–16, 〕 Moisil however published in 1964 a logic to match his algebra (in the general ''n'' ≥ 5 case), now called Moisil logic.〔 After coming in contact with Zadeh's fuzzy logic, in 1968 Moisil also introduced an infinitely-many-valued logic variant and its corresponding LM''θ'' algebras.〔Georgescu, G., Iourgulescu, A., Rudeanu, S.: "(Grigore C. Moisil (1906–1973) and his School in Algebraic Logic )." International Journal of Computers, Communications & Control 1, 81–99 (2006)〕 Although the Łukasiewicz implication cannot be defined in a LM''n'' algebra for ''n'' ≥ 5, the Heyting implication can be, i.e. LM''n'' algebras are Heyting algebras; as a result, Moisil logics can also be developed (from a purely logical standpoint) in the framework of Brower’s intuitionistic logic.〔, Theorem 3.6〕 == Definition == A LM''n'' algebra is a De Morgan algebra (a notion also introduced by Moisil) with ''n''-1 additional unary, "modal" operations: $\backslash nabla\_1,\; \backslash ldots,\; \backslash nabla\_$, i.e. an algebra of signature $(A,\; \backslash vee,\; \backslash wedge,\; \backslash neg,\; \backslash nabla\_,\; 0,\; 1)$ where ''J'' = . (Some sources denote the additional operators as $\backslash nabla^n\_$ to emphasize that they depend on the order ''n'' of the algebra.〔Cignoli, R., “The algebras of Lukasiewicz many-valued logic - A historical overview,” in S. Aguzzoli et al.(Eds.), Algebraic and Proof-theoretic Aspects of Non-classical Logics, LNAI 4460, Springer, 2007, 69-83. 〕) The additional unary operators ∇''j'' must satisfy the following axioms for all ''x'', ''y'' ∈ ''A'' and ''j'', ''k'' ∈ ''J'':〔 # $\backslash nabla\_j(x\; \backslash vee\; y)\; =\; (\backslash nabla\_j\backslash ;\; x)\; \backslash vee\; (\backslash nabla\_j\backslash ;\; y)$ # $\backslash nabla\_j\backslash ;x\; \backslash vee\; \backslash neg\; \backslash nabla\_j\backslash ;x\; =\; 1$ # $\backslash nabla\_j\; (\backslash nabla\_k\backslash ;x)\; =\; \backslash nabla\_k\backslash ;x$ # $\backslash nabla\_j\; \backslash neg\; x\; =\; \backslash neg\; \backslash nabla\_\backslash ;x$ # $\backslash nabla\_1\backslash ;x\backslash leq\; \backslash nabla\_2\backslash ;x\backslash cdots\backslash leq\; \backslash nabla\_\backslash ;x$ # if $\backslash nabla\_j\backslash ;x\; =\; \backslash nabla\_j\backslash ;y$ for all ''j'' ∈ ''J'', then ''x'' = ''y''. (The adjective "modal" is related to the (failed ) program of Tarksi and Łukasiewicz to axiomatize modal logic using many-valued logic.) 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Łukasiewicz–Moisil algebra」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.